package algorithms;

public class TestGraph {

	public static void main(String[] args) {
		Graph graph = new Graph();
		
		String [] Peaks1 = {"B","G",null};
		graph.Add_Peak(new Peak("A"),Peaks1);
		String [] Peaks2 = {"C","D", null};
		graph.Add_Peak(new Peak("B"),Peaks2);
		String [] Peaks3 = {"E", null};
		graph.Add_Peak(new Peak("C"),Peaks3);
		String [] Peaks4 = {"E","F", null};
		graph.Add_Peak(new Peak("D"),Peaks4);
		String [] Peaks5 = {"H", null};
		graph.Add_Peak(new Peak("E"),Peaks5);
		String [] Peaks6 = {"H", null};
		graph.Add_Peak(new Peak("F"),Peaks6);
		String [] Peaks7 = {"H", null};
		graph.Add_Peak(new Peak("G"),Peaks7);
		String [] Peaks8 = {"",null};
		graph.Add_Peak(new Peak("H"),Peaks8);
		System.out.println(graph.m);
		//System.out.println(graph.m.Get_Map("H").next[0]);
		graph.Table();
	}

}
